PARTIF: Interactive System-level Partitioning
نویسندگان
چکیده
منابع مشابه
Interactive Partitioning (System Demonstration, Short)
Partitioning is often used to support better graph drawing; in this paper, we describe an interactive system in which graph drawing is used to support better partitioning. In our system the user is presented with a drawing of a current network partitioning, and is responsible for choosing appropriate optimization procedures and for focusing their application on portions of the network. Our pilo...
متن کاملAdaptive Metrics for System-Level Functional Partitioning
Codesign is a design methodology aiming at the integration of both hardware and software into the same System-on-Chip architecture. This paper presents a new methodology to address the Codesign problem based on the adaptive computation approach. Adaptivity implies that due to input changes the output of the system is updated by only re-evaluating those portions of the program affected by the ch...
متن کاملA Framework for System-Level Partitioning of Object-Oriented Specifications
Object-oriented descriptions are gaining more and more importance in the high-level specification of hardware/software systems. Hiding the complexity from the developer is one of the key tasks in order to master the complexity of todays systems. With the high grade of abstraction necessary on the system level the automatic partitioning of a system is a difficult problem. In this paper we theref...
متن کاملTask Level Partitioning Using the Ant System Algorithm
System design techniques will soon become a necessity in order to tame the immense complexity of future computing systems. This is especially true with the advent of complex system architectures that contain a variety of computing components like microprocessors, memory elements and reconfigurable logic. System partitioning is an important step in the system design process. The problem assigns ...
متن کاملn-Level Hypergraph Partitioning
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time and thus allows very high quality. This includes a rating function that avoids nonuniform vertex weights, an efficient “semi-dynamic” hypergraph data structure, a very fast coarsening algorithm, and two new local search algorithms. One is a k-way hypergraph adaptation of Fiduccia-Mattheyses l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1995
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1995/28167